Extending Characterizations of Lattice Supersolvability
نویسنده
چکیده
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n without repetition. These labellings are called Sn EL-labellings, and having such a labelling is also equivalent to possessing a maximal chain of left modular elements. In the case of an ungraded lattice, there is a natural extension of Sn EL-labellings, called interpolating labellings. We show that admitting an interpolating labelling is again equivalent to possessing a maximal chain of left modular elements. Furthermore, we work in the setting of a general bounded poset as all the above results generalize to this case.
منابع مشابه
Supersolvable Frame-matroid and Graphic-lift Lattices
A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...
متن کاملCharacterizations of $L$-convex spaces
In this paper, the concepts of $L$-concave structures, concave $L$-interior operators and concave $L$-neighborhood systems are introduced. It is shown that the category of $L$-concave spaces and the category of concave $L$-interior spaces are isomorphic, and they are both isomorphic to the category of concave $L$-neighborhood systems whenever $L$ is a completely distributive lattice. Also, it i...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کاملOn fuzzy convex lattice-ordered subgroups
In this paper, the concept of fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) of an ordered group (resp. lattice-ordered group) is introduced and some properties, characterizations and related results are given. Also, the fuzzy convex subgroup (resp. fuzzy convex lattice-ordered subgroup) generated by a fuzzy subgroup (resp. fuzzy subsemigroup) is characterized. Furthermore,...
متن کاملFactorization of the Characteristic Polynomial
We introduce a new method for showing that the roots of the characteristic polynomial of a finite lattice are all nonnegative integers. Our main theorem gives two simple conditions under which the characteristic polynomial factors in this way. We will see that Stanley’s Supersolvability Theorem is a corollary of this result. We can also use this method to demonstrate the factorization of a poly...
متن کامل